k-DISTANT CROSSINGS AND NESTINGS OF MATCHINGS AND PARTITIONS
نویسنده
چکیده
We define and consider k-distant crossings and nestings for matchings and set partitions, which are a variation of crossings and nestings in which the distance between vertices is important. By modifying an involution of Kasraoui and Zeng (Electronic J. Combinatorics 2006, research paper 33), we show that the joint distribution of k-distant crossings and nestings is symmetric. We also study the numbers of k-distant noncrossing matchings and partitions for small k, which are counted by well-known sequences, as well as the orthogonal polynomials related to k-distant noncrossing matchings and partitions. We extend Chen et al.’s r-crossings and enhanced r-crossings.
منابع مشابه
Distribution of Crossings, Nestings and Alignments of Two Edges in Matchings and Partitions
We construct an involution on set partitions which keeps track of the numbers of crossings, nestings and alignments of two edges. We derive then the symmetric distribution of the numbers of crossings and nestings in partitions, which generalizes a recent result of Klazar and Noy in perfect matchings. By factorizing our involution through bijections between set partitions and some path diagrams ...
متن کاملCrossings and Nestings for Arc-Coloured Permutations and Automation
Symmetric joint distribution between crossings and nestings was established in several combinatorial objects. Recently, Marberg extended Chen and Guo’s result on coloured matchings to coloured set partitions following a multi-dimensional generalization of the bijection and enumerative methods from Chen, Deng, Du, Stanley, and Yan. We complete the study for arc-coloured permutations by establish...
متن کاملCrossings and Nestings of Two Edges in Set Partitions
Let π and λ be two set partitions with the same number of blocks. Assume π is a partition of [n]. For any integer l,m ≥ 0, let T (π, l) be the set of partitions of [n+ l] whose restrictions to the last n elements are isomorphic to π, and T (π, l,m) the subset of T (π, l) consisting of those partitions with exactly m blocks. Similarly define T (λ, l) and T (λ, l,m). We prove that if the statisti...
متن کاملLinked partitions and linked cycles
The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schröder number rn, which counts the number of Schröder paths. In this paper we give a bijective proof of this result. Then we introduce the structures of linked partitions and linked cy...
متن کاملIncreasing and Decreasing Sequences of Length Two in 01-fillings of Moon Polyominoes
The main purpose of this paper is to put recent results of Klazar and Noy [10], Kasraoui and Zeng [9], and Chen, Wu and Yan [2], on the enumeration of 2-crossings and 2-nestings in matchings, set partitions and linked partitions in the larger context of enumeration of increasing and decreasing chains in fillings of arrangements of cells. Our work is motivated by the recent paper of Krattenthale...
متن کامل